Connectivity of Semiring Valued Graphs

Graph connectivity theory is important in network implementations, transportation, routing and tolerance, among other things. Separation edges vertices refer to single points of failure a network, so they are often sought-after. Chandramouleeswaran et al. introduced the principle semiring valued graphs, also known as S-valued symmetry 2015. Since then, works on graphs such vertex dominating set, edge regularity, etc. have been done. However, has not studied. Motivated by this, this paper, concept We term S-connectivity arrived some results for complete graph, S-path S-star. Unlike graph theory, we observed that inequality κ(G)≤κ′(G)≤δ(G) holds case only when there seen Examples 3–5.